package tree;

/**
 * 后续遍历（左-右-根）
 * 简单
 * https://leetcode-cn.com/problems/binary-tree-postorder-traversal/
 */
public class PostorderTraversal {

    public static void main(String[] args) {

    }



}
